Fast Hankel Transform and Its Application to Beam

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

construction and validation of translation metacognitive strategy questionnaire and its application to translation quality

like any other learning activity, translation is a problem solving activity which involves executing parallel cognitive processes. the ability to think about these higher processes, plan, organize, monitor and evaluate the most influential executive cognitive processes is what flavell (1975) called “metacognition” which encompasses raising awareness of mental processes as well as using effectiv...

Application of the generalized shift operator to the Hankel transform

It is well known that the Hankel transform possesses neither a shift-modulation nor a convolution-multiplication rule, both of which have found many uses when used with other integral transforms. In this paper, the generalized shift operator, as defined by Levitan, is applied to the Hankel transform. It is shown that under this generalized definition of shift, both convolution and shift theorem...

متن کامل

Fast Hankel tensor-vector product and its application to exponential data fitting

This paper is contributed to a fast algorithm for Hankel tensor–vector products. First, we explain the necessity of fast algorithms for Hankel and block Hankel tensor–vector products by sketching the algorithm for both one-dimensional and multi-dimensional exponential data fitting. For proposing the fast algorithm, we define and investigate a special class of Hankel tensors that can be diagonal...

متن کامل

A Fast Analysis-Based Discrete Hankel Transform Using Asymptotic Expansions

A fast and numerically stable algorithm is described for computing the discrete Hankel transform of order 0 as well as evaluating Schlömilch and Fourier–Bessel expansions in O(N(logN)2/ loglogN) operations. The algorithm is based on an asymptotic expansion for Bessel functions of large arguments, the fast Fourier transform, and the Neumann addition formula. All the algorithmic parameters are se...

متن کامل

Is the fast Hankel transform faster than quadrature?

The fast Hankel transform (FHT) implemented with digital filters has been the algorithm of choice in EM geophysics for a few decades. However, other disciplines have predominantly relied on methods that break up the Hankel transform integral into a sum of partial integrals that are each evaluated with quadrature. The convergence of the partial sums is then accelerated through a nonlinear sequen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: DEStech Transactions on Computer Science and Engineering

سال: 2018

ISSN: 2475-8841

DOI: 10.12783/dtcse/cmsam2018/26573